翻訳と辞書
Words near each other
・ Gábor Szabó (disambiguation)
・ Gábor Szakácsi
・ Gábor Szalafai
・ Gábor Szegvári
・ Gábor Szegő
・ Gábor Szeremlei
・ Gábor Szetey
・ Gábor Szilágyi
・ Gábor Sztankó
・ Gábor Szűcs
・ Gábor T. Szántó
・ Gábor Takács
・ Gábor Takács-Nagy
・ Gábor Talmácsi
・ Gábor Tamás Nagy
Gábor Tardos
・ Gábor Tompa
・ Gábor Torma
・ Gábor Totola
・ Gábor Tánczos
・ Gábor Tóth
・ Gábor Tóth (politician)
・ Gábor Török
・ Gábor Török (footballer)
・ Gábor Török (political scientist)
・ Gábor Törő
・ Gábor Ugron
・ Gábor Urbán
・ Gábor Vajna
・ Gábor Vajta


Dictionary Lists
翻訳と辞書 辞書検索 [ 開発暫定版 ]
スポンサード リンク

Gábor Tardos : ウィキペディア英語版
Gábor Tardos

Gábor Tardos (born 11 July 1964) is a Hungarian mathematician, currently a professor and Canada Research Chair at Simon Fraser University. He works mainly in combinatorics and computer science. He is the younger brother of Éva Tardos.〔(Baseball Families and Math Families ), William Gasarch, February 12, 2009.〕
==Mathematical results==
Tardos started with a result in universal algebra: he exhibited a maximal clone of monotone operations which is not finitely generated. He obtained partial results concerning the Hanna Neumann conjecture. With his student, Adam Marcus, he proved a combinatorial conjecture of Zoltán Füredi and Péter Hajnal which was known to imply the Stanley–Wilf conjecture. With topological methods he proved that if \mathcal is a finite set system consisting of the unions of intervals on two disjoint lines, then \tau(\mathcal)\leq 2\nu(\mathcal) holds, where \tau(\mathcal) is the least number of points covering all elements of \mathcal and \nu(\mathcal) is the size of the largest disjoint subsystem of \mathcal. Tardos worked out a method for optimal probabilistic fingerprint codes. Although the mathematical content is hard, the algorithm is easy to implement.

抄文引用元・出典: フリー百科事典『 ウィキペディア(Wikipedia)
ウィキペディアで「Gábor Tardos」の詳細全文を読む



スポンサード リンク
翻訳と辞書 : 翻訳のためのインターネットリソース

Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.